Formulas for the Number of Spanning Trees in a Maximal Planar Map
نویسندگان
چکیده
The number of spanning trees of a map C denoted by τ(C) is the total number of distinct spanning subgraphs of C that are trees. A maximal planar map is a simple graph G formed by n vertices, 3(n − 2) edges and all faces having degree 3 [2]. In this paper, we derive the explicit formula for the number of spanning trees of the maximal planar map and deduce a formula for the number of spanning trees of the crystal planar map. Mathematics Subject Classification: 05C85, 05C30
منابع مشابه
NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملOn relation between the Kirchhoff index and number of spanning trees of graph
Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملCounting the Number of Spanning Trees in the Star Flower Planar Map
Abstract The number of spanning trees of a graph G is the total number of distinct spanning subgraphs of G that are trees (tree that visiting all the vertices of the graph G). Let Cn be a cycle with n vertices. The Star flower planar map is a simple graph G formed from a cycle Cn by adding a vertex adjacent to every edge of Cn and we connect this vertex with two end vertices of each edge of Cn,...
متن کاملA Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
Given a graph G, a designated vertex r and a natural number k, we wish to find k “independent” spanning trees ofG rooted at r, that is, k spanning trees such that, for any vertex v, the k paths connecting r and v in the k trees are internally disjoint in G. In this paper we give a linear-time algorithm to find k independent spanning trees in a k-connected maximal planar graph rooted at any desi...
متن کامل